Some new light subgraphs in the 1-planar graphs
نویسنده
چکیده
A graph is 1-planar if it can be drawn in the plane such that every edge crosses at most one other edge. A connected graph H is strongly light in a family of graphs G, if there exists a constant λ, such that every graph G in G contains a subgraph K isomorphic to H with degG(v) ≤ λ for all v ∈ V(K). In this paper, we present some strongly light subgraphs in the family of 1-planar graphs with minimum degree 7.
منابع مشابه
New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملA Characterization of Radial Graphs
A level graph G = (V,E, λ) is a graph with a mapping λ : V → {1, . . . , k}, k ≥ 1, that partitions the vertex set V as V = V1 ∪ . . . ∪ Vk, Vj = λ−1(j), Vi ∩ Vj = ∅ for i ̸= j, such that λ(v) = λ(u) + 1 for each edge (u, v) ∈ E. Thus a level planar graph can be drawn with the vertices of every Vj , 1 ≤ j ≤ k, placed on a horizontal line, representing the level lj , and without crossings of edge...
متن کاملTOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS
Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to minimum cardinality of total dominating set in $G$ and denoted by $gamma_t(G)$. The total domination polynomial of $G$ is the polynomial $D_t(G,x)=sum d_t(G,i)$, where $d_t(G,i)$ is the numbe...
متن کاملApproximate Minimum 2-Connected Subgraphs in Weighted Planar Graphs
We consider the problems of finding the minimum-weight 2-connected spanning subgraph in edge-weighted planar graphs and its variations. We first give a PTAS for the problem of finding minimum-weight 2-edge-connected spanning subgraphs where duplicate edges are allowed. Then we present a new greedy spanner construction for edge-weighted planar graphs. From this we derive quasi-polynomial time ap...
متن کاملWeights of induced subgraphs in K1, r-free graphs
Let H be a subgraph of a given graph G. The weight w(H) = v∈V (H) d G (v) is the sum of the degrees of all vertices of H in G. Investigations of this parameter are initiated by the beautiful result of Kotzig in 1955 who proved that every planar graphs contains an edge of weight at most 13. Meanwhile there are many results for planar graphs and graphs embedded on general surfaces concerning the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1304.6896 شماره
صفحات -
تاریخ انتشار 2013